The Zero Lower Bound

نویسنده

  • Eric Sims
چکیده

In the standard New Keynesian model, monetary policy is often described by an interest rate rule (e.g. a Taylor rule) that moves the interest rate in response to deviations of inflation and some measure of economic activity from target. Nominal interest rates are bound from below by 0 – since money is storable, one would never accept a negative nominal return. How does the behavior of the NK model change when interest rates hit zero and cannot freely adjust in response to changing economic conditions? To answer this question, we consider the implications of an interest rate peg in the model. This isn’t literally what happens at the zero lower bound, but what matters in the model is not that the interest rate is zero per se, but rather that it becomes unresponsive to economic conditions. In the experiments I consider, the nominal interest rate is pegged at a fixed value for a finite (and deterministic) period of time. After the peg, monetary policy obeys a simple Taylor rule. It turns out to be relatively straightforward to modify a Dynare code to take this into account. I include a government spending shock in the model so that we can analyze the effects of government spending shocks at the zero lower bound, which has been a topic of much recent interest. The interest rate peg ends up exacerbating the effects of price stickiness. In particular, output responds even less to a positive supply shock (productivity) and more to “demand” shocks (government spending) than under a standard Taylor rule. This operates through an inflation channel and the Fisher relationship: positive supply shocks lower inflation, which raises real interest rates if nominal rates are unresponsive, with the reverse holding for a demand shock like government spending.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Appling Metaheuristic Algorithms on a Two Stage Hybrid Flowshop Scheduling Problem with Serial Batching (RESEARCH NOTE)

In this paper the problem of serial batch scheduling in a two-stage hybrid flow shop environment with minimizing Makesapn is investigated. In serial batching it is assumed that jobs in a batch are processed serially, and their completion time is defined to be equal to the finishing time of the last job in the batch. The analysis and implementation of the prohibited transference of jobs among th...

متن کامل

A Two-Stage Hybrid Flowshop Scheduling Problem with Serial Batching

In this paper the problem of serial batch scheduling in a two-stage hybrid flow shop environment with minimizing Makesapn is studied. In serial batching it is assumed that jobs in a batch are processed serially, and their completion time is defined to be equal to the finishing time of the last job in the batch. The analysis and implementation of the prohibited transference of jobs among the mac...

متن کامل

A generalization of zero-divisor graphs

In this paper, we introduce a family of graphs which is a generalization of zero-divisor graphs and compute an upper-bound for the diameter of such graphs. We also investigate their cycles and cores

متن کامل

Solving Fully Fuzzy Linear Programming Problems with Zero-One Variables by Ranking Function

Jahanshahloo has suggested a method for the solving linear programming problems with zero-one variables‎. ‎In this paper we formulate fully fuzzy linear programming problems with zero-one variables and a method for solving these problems is presented using the ranking function and also the branch and bound method along with an example is presented.

متن کامل

A New Lower Bound for Completion Time Distribution Function of Stochastic PERT Networks

In this paper, a new method for developing a lower bound on exact completion time distribution function of stochastic PERT networks is provided that is based on simplifying the structure of this type of network. The designed mechanism simplifies network structure by arc duplication so that network distribution function can be calculated only with convolution and multiplication. The selection of...

متن کامل

A New Lower Bound for Completion Time Distribution Function of Stochastic PERT Networks

In this paper, a new method for developing a lower bound on exact completion time distribution function of stochastic PERT networks is provided that is based on simplifying the structure of this type of network. The designed mechanism simplifies network structure by arc duplication so that network distribution function can be calculated only with convolution and multiplication. The selection of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014